Choosability on H-free graphs
نویسندگان
چکیده
A graph is H-free if it has no induced subgraph isomorphic to H. We determine the computational complexity of the Choosability problem restricted to H-free graphs for every graph H that does not belong to {K1,3, P1 +P2, P1 +P3, P4}. We also show that if H is a linear forest, then the problem is fixed-parameter tractable when parameterized by k.
منابع مشابه
Star and Biclique Coloring and Choosability
A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained in the closed neighborhood of a vertex. A star (biclique) k-coloring of G is a k-coloring of G that contains no monochromatic maximal stars (bicliques). Similarly, for a list assignment L of G, a star (biclique) L-coloring is an L-coloring of G in which no maximal star (biclique) is monochromatic...
متن کاملTriangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
We show that triangle-free penny graphs have degeneracy at most two, list coloring number (choosability) at most three, diameter D = Ω( √ n), and at most min ( 2n−Ω( √ n), 2n−D − 2 ) edges.
متن کاملBounds on circular consecutive choosability
The circular consecutive choosability chcc(G) of a graph G has been recently introduced in [2]. In this paper we prove upper bounds on chcc for series-parallel graphs, planar graphs and k-choosable graphs. Our bounds are tight for classes of series-parallel graphs and k-choosable graphs for k ≥ 3. Then we study the circular consecutive choosability of generalized theta graphs. Lower bounds for ...
متن کاملDefective Choosability of Graphs without Small Minors
For each proper subgraph H of K5, we determine all pairs (k, d) such that every H-minor-free graph is (k, d)-choosable or (k, d)-choosable. The main structural lemma is that the only 3-connected (K5 − e)-minor-free graphs are wheels, the triangular prism, and K3,3; this is used to prove that every (K5 − e)-minor-free graph is 4-choosable and (3, 1)-choosable.
متن کاملFree Choosability of Outerplanar Graphs
AgraphG is free (a, b)-choosable if for any vertex v with b colors assigned and for any list of colors of size a associated with each vertex u = v, the coloring can be completed by choosing for u a subset of b colors such that adjacent vertices are colored with disjoint color sets. In this note, a necessary and sufficient condition for a cycle to be free (a, b)-choosable is given. As a corollar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013